PDL Inside the ?-calculus: A Syntactic and an Automata-theoretic Characterization
نویسندگان
چکیده
It is well known that Propositional Dynamic Logic (PDL) can be seen as a fragment of the modal μ-calculus. In this paper we provide an exact syntactic characterization of the fragments of the μ-calculus that correspond to PDL and to test-free PDL. In addition we give automata-theoretic characterizations for PDL, with and without tests, which shed light on the relation between these logics and the modal μ-calculus and provide a new framework for the development of the theory of PDL.
منابع مشابه
Games with Second-order Quantiiers Which Decide Propositional Program Logics
The paper demonstrates how second-order quantiication and nite games can be exploited for deciding complicated propositional program logics like the propositional-Calculus with converse (C ?). This approach yields a new proof that C ? is in EXP T IME. Automata-theoretic technique is a very powerful and popular approach for deciding complicated propositional program logics 19, 20, 3]. The rst pa...
متن کاملCharacterization theorems for PDL and FO(TC)
Our main contributions can be divided in three parts: (1) Fixpoint extensions of first-order logic: we give a precise syntactic and semantic characterization of the relationship between FO(TC) and FO(LFP). (2) Automata and expressiveness on trees: we introduce a new class of parity automata which, on trees, captures the expressive power of FO(TC) and WCL (weak chain logic). The latter logic is ...
متن کاملSome model theory for the modal μ-calculus: syntactic characterisations of semantic properties
This paper contributes to the theory of the modal μ-calculus by proving some model-theoretic results. More in particular, we discuss a number of semantic properties pertaining to formulas of the modal μ-calculus. For each of these properties we provide a corresponding syntactic fragment, in the sense that a μ-formula ξ has the given property iff it is equivalent to a formula ξ′ in the correspon...
متن کاملParity Games and Automata for Game Logic (Extended Version)
Parikh’s game logic is a PDL-like fixpoint logic interpreted on monotone neighbourhood frames that represent the strategic power of players in determined two-player games. Game logic translates into a fragment of the monotone μ-calculus, which in turn is expressively equivalent to monotone modal automata. Parity games and automata are important tools for dealing with the combinatorial complexit...
متن کاملParity Games and Automata for Game Logic
Parikh’s game logic is a PDL-like fixpoint logic interpreted on monotone neighbourhood frames that represent the strategic power of players in determined two-player games. Game logic translates into a fragment of the monotone μ-calculus, which in turn is expressively equivalent to monotone modal automata. Parity games and automata are important tools for dealing with the combinatorial complexit...
متن کامل